A New Decomposition Scheme for Parallel Resolution of the Satisfiability Problem (SAT)
نویسندگان
چکیده
A new Joining and model Checking scheme (JaCk-SAT) for parallel resolution of the SATisfiability problem is presented. The main goal of this methodology is to cut the variable-set in two subsets of about equal size. In contrast with recent propositions [12,16] for sequential resolution only, we do not use sophisticated hypergraph decomposition techniques such as Tree Decomposition that are very likely infeasible. Moreover we do not require a complete bipartition of the clause-set that induces in general a large joining variable-set, but we define a tripartition letting apart a third residual clause-set to be checked. The very first preliminary results of this new approach are presented. keywords: Decomposition, Parallel Resolution, Propositional Satisfiability (SAT).
منابع مشابه
Parallel Resolution of the Satisfiability Problem: A Survey
The past few years have seen enormous progress in the performance of propositional satisfiability (SAT) solvers, and consequently SAT solvers are widely used in industry for many applications. In spite of this progress, there is strong demand for higher SAT algorithms efficiency to solve harder and larger problems. Unfortunately, most modern solvers are sequential and fewer are parallel. Our in...
متن کاملAlgorithms for the satisfiability (SAT) problem: A survey
The satisfiability (SAT) problem is a core, problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, c...
متن کاملOn Tackling the Limits of Resolution in SAT Solving
The practical success of Boolean Satisfiability (SAT) solvers stems from the CDCL (Conflict-Driven Clause Learning) approach to SAT solving. However, from a propositional proof complexity perspective, CDCL is no more powerful than the resolution proof system, for which many hard examples exist. This paper proposes a new problem transformation, which enables reducing the decision problem for for...
متن کاملA Random Constraint Satisfaction Problem That Seems Hard for DPLL
This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so is easier to analyze. For example, the exact satisfiability threshold for this problem is known, and the problem has high resolution complexity. In this paper, we prove the problem appears hard for DPLL. Specifically, if we pick...
متن کاملCADICAL, LINGELING, PLINGELING, TREENGELING and YALSAT Entering the SAT Competition 2017
This paper serves as a first solver description for our new SAT solver CADICAL and documents the versions of our other solvers submitted to the SAT Competition 2017, which are LINGELING, its two parallel variants TREENGELING and PLINGELING, and our local search solver YALSAT. LINGELING,PLINGELING, TREENGELING,YALSAT Our focus in the SAT Competition 2016 was on our new SAT solver SPLATZ [1]. It ...
متن کامل